Finding a Princess in a Palace: a Pursuit-Evasion Problem
نویسندگان
چکیده
This paper solves a pursuit–evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied ‘Cops and Robbers Game’, the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to find the princess.
منابع مشابه
Multi-Player Pursuit-Evasion Differential Games
The increasing use of unmanned assets and robots in modern military operations renews an interest in the study of general pursuit-evasion games involving multiple pursuers and multiple evaders. Due to the difficulty in formulation and rigorous treatment, the literature in this field is very limited. This paper presents a hierarchical approach to this kind of problem. With an additional structur...
متن کاملRoadmap-Based Pursuit-Evasion in 3D Structures
We present an approach to the pursuit-evasion problem which is applicable to complex, multi-level environments. Studying each aspect of this problem in 3D structured environments is a distinct extension over many previous approaches. We also utilize our roadmap-based approach to multi-agent behavior when tracking agents of interest. Results are presented in three multi-level environments to hig...
متن کاملDiscrete Time Stochastic Hybrid Dynamic Games: Part I - Formulation & Applications
We formulate a framework for discrete time stochastic hybrid dynamic game with two players and consider the reach-avoid problem, i.e. finding the probability that the system trajectory starting from any initial condition enters a target set while avoiding the obstacle set in a given time-horizon. We formulate the reach-avoid problem as a zero-sum stochastic game and show that the verification a...
متن کاملProbing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximately, and a single parameter determines a curve that traces the optimal trade-off between the least-squares fit and the one-norm of the solution. We prove that this curve is convex and continuously differentiable over ...
متن کاملPursuit/Evasion Voronoi Diagrams∗
In typical 2D Voronoi diagrams, the distance from a site to a point in the plane is unaffected by the existance of other sites. In 2D pursuit/evasion Voronoi diagrams, the distance from an evader to a point is the length of the shortest path to that point that avoids all pursuers. Since pursuers can move, the paths that evaders follow to reach certain points in the plane can be quite complicate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013